Determinization of transducers over finite and infinite words

Determinization of transducers over finite and infinite words

Rankers over Infinite Words

We consider the fragments FO, Σ2 ∩ FO, Π2 ∩ FO, and ∆2 of first-order logic FO[<] over finite and infinite words. For all four fragments, we give characterizations in terms of rankers. In particular, we generalize the notion of a ranker to infinite words in two possible ways. Both extensions are natural in the sense that over finite words, they coincide with classical rankers and over infinite ...

Group Extensions over Infinite Words

We construct an extension E(A,G) of a given group G by infinite nonArchimedean words over an discretely ordered abelian group like Z. This yields an effective and uniform method to study various groups that ”behave like G”. We show that the Word Problem for f.g. subgroups in the extension is decidable if and only if and only if the Cyclic Membership Problem in G is decidable. The present paper ...

Finite State Transducers for Recognition and Generation of Compound Words

In this paper we present how finite state transducers can be effectively used for compound treatment in text analysis. The approach that we use is particularly well suited for text processing based on the usage of morphological electronic dictionaries and finite state technology. The results that we present do not aim to be comprehensive but rather illustrative of the power of possibilities, on...

Determinization of weighted finite automata over strong bimonoids

We consider weighted finite automata over strong bimonoids, where these weight structures can be considered as semirings which might lack distributivity. Then, in general, the well-known run semantics, initial algebra semantics, and transition semantics of an automaton are different. We prove an algebraic characterization for the initial algebra semantics in terms of stable finitely generated s...